Automorphism Group of the Derangement Graph
نویسندگان
چکیده
منابع مشابه
Automorphism Group of the Derangement Graph
In this paper, we prove that the full automorphism group of the derangement graph Γn (n ≥ 3) is equal to (R(Sn) ⋊ Inn(Sn)) ⋊ Z2, where R(Sn) and Inn(Sn) are the right regular representation and the inner automorphism group of Sn respectively, and Z2 = 〈φ〉 with the mapping φ : σ φ = σ−1, ∀σ ∈ Sn. Moreover, all orbits on the edge set of Γn (n ≥ 3) are determined.
متن کاملThe Automorphism Group of Commuting Graph of a Finite Group
Let G be a finite group and X be a union of conjugacy classes of G. Define C(G,X) to be the graph with vertex set X and x, y ∈ X (x 6= y) joined by an edge whenever they commute. In the case that X = G, this graph is named commuting graph of G, denoted by ∆(G). The aim of this paper is to study the automorphism group of the commuting graph. It is proved that Aut(∆(G)) is abelian if and only if ...
متن کاملAutomorphism group and diameter of a graph
Given a connected graph Γ of order n and diameter d, we establish a tight upper bound for the order of the automorphism group of Γ as a function of n and d, and determine the graphs for which the bound is attained.
متن کاملTHE AUTOMORPHISM GROUP OF FINITE GRAPHS
Let G = (V,E) be a simple graph with exactly n vertices and m edges. The aim of this paper is a new method for investigating nontriviality of the automorphism group of graphs. To do this, we prove that if |E| >=[(n - 1)2/2] then |Aut(G)|>1 and |Aut(G)| is even number.
متن کاملStructure of the automorphism group of the augmented cube graph
The augmented cube graph AQn is the Cayley graph of Z n 2 with respect to the set of 2n− 1 generators {e1, e2, . . . , en, 00 . . . 0011, 00 . . . 0111, 11 . . . 1111}. It is known that the order of the automorphism group of the graph AQn is 2 n+3, for all n ≥ 4. In the present paper, we obtain the structure of the automorphism
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2011
ISSN: 1077-8926
DOI: 10.37236/685